Amoeba-Based Emergent Computing: Combinatorial Optimization and Autonomous Meta-Problem Solving
نویسندگان
چکیده
1Frontier Research System, RIKEN (The Institute of Physical and Chemical Research), Wako, Saitama 351-0198, Japan E-mail: [email protected] 2Institute of Industrial Science, The University of Tokyo, Meguro, Tokyo 153-8505, Japan, and ERATO Aihara Complexity Modelling Project, JST, Shibuya-ku, Tokyo 151-0064, Japan E-mail: [email protected] 3Computer and Information Science Department, Cleveland State University, Cleveland, OH 44115, USA E-mail: [email protected]
منابع مشابه
Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملCombinatorial optimization and self-disciplined computing by amoeba-based neurocomputer
Creating a biocomputer with its hardware incorporating biological materials, is it possible to implement some unique functions that are difficult for conventional digital computers to deal with? A living organism is a hierarchically-structured system in which a number of self-organization processes run simultaneously on its multiple levels with their characteristic spatiotemporal scales. Becaus...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJUC
دوره 6 شماره
صفحات -
تاریخ انتشار 2010